Parallel Huffman Decoder with an Optimize Look UP

نویسندگان

  • Zulkalnain Mohd Yusof
  • Ishak Suleiman
چکیده

Total Bit = PnXBi t Abstract Compression is very important for system with limited channel bandwidth and/or limited storage size. One of the main components in imagehideo compression is a variable length coding (VLC). This paper would discuss about one of the most popular VLC known as Huffman Coding. In our present work, a real time hardware parallel Huffman decoder has been successfully designed and implemented using 50,000 gate FPGA (FLEX1OK20 from Altera). The parallelism is important to be exploited in the design to achieve the high frame rate such as in JPEG and MPEG implementation. Using parallel technique, a codeword is guaranteed to be processed within a single clock cycle. The codeword to be processed is matched with the one stored in a Look Up Table (LUT). A LUT is needed during Coder and Decoder process. In order to saves memory cost, an optimize LUT is suggested. This paper does not intend to complete an optimized operating speed design, instead this paper only concentrate on producing a workable real-time decoder design.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

High Speed Pipelined Parallel Huffman Decoding

This paper introduces a new class of Huffman decoders which is a developmet of the parallel Huffman decoder model. With pipelining and partitioning, a regular architecture with an arbitrary degree of pipelining is developed. The proposed architecture dramatically reduces the symbol decoder requirements compared to previous results, and still is the actual implementation of the symbol decoder no...

متن کامل

A Fast Parallel Huffman Decoder for Fpga Implementation

The paper presents a novel algorithm and architecture for implementing a Huffman decoder. It starts with an overview of the basics, from the entropy coding and the way the Huffman coding is obtained, to the way a Huffman coder handles data and image components within the Jpeg standard. Then it briefly discusses the decoding procedures proposed by the ISO/IEC 109181(1993E) standard; due to their...

متن کامل

University of Warsaw Faculty of Mathematics , Informatics and Mechanics Marek Biskup

In compressed data a single bit error propagates because of the corruption of the decoder’s state. This work is a study of error resilience in compressed data and, in particular, of the recovery of as much data as possible after a bit error. It is focused on Huffman codes. In a message encoded with a Huffman code a bit error causes the decoder to lose synchronization with the coder. The error p...

متن کامل

Huffman-based code compression techniques for embedded systems

Increasing embedded systems functionality causes a steep increase in code size. For instance, more than 60MB of software is installed in current state-of-the-art cars [9]. It is often challenging and cumbersome to host vast amount of software in an efficient way within a given hardware resource budget of an embedded system. This may be done by using code compression techniques, which compress t...

متن کامل

Design optimization of main-profile MPEG-2 AAC decoder

In this paper, a system architecture optimized for the 2-channel main-profile MPEG-2 AAC decoder is presented. In order to enable an efficient job scheduling and allocation, the presented system comprises three hardware modules: Huffman decoder module, predictor module, and processing core module which is programmable using an assembly language of its own. Huffman decoder is designed to finish ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004